Bilangan Kromatik Graceful Pada Keluarga Graf Grid
نویسندگان
چکیده
All graph in this paper be a connected and simple graph. Let c:V(G)→{1,2,…,k} is proper vertex coloring where k ≥ 2 which induces edge c':E(G)→{1,2,…,k} define by c' (uv)=|c(u)-c(v)|, uv E(G) called graceful k-coloring. A c of G if k-coloring for some k∈ N. The minimum chromatic number denoted χ_g (G). In paper, we will investigate the establish exact value on grid family namely H 〖(H〗_n) n≥2 m,n≥3.
 Keywords: coloring, number,
منابع مشابه
A GrAF-compliant Indonesian Speech Recognition Web Service on the Language Grid for Transcription Crowdsourcing
This paper describes the development of an Indonesian speech recognition web service which complies with two standards: it operates on the Language Grid, ensuring process interoperability, and its output uses the LAF/GrAF format, ensuring data interoperability. It is part of a larger system, currently in development, that aims to collect speech transcriptions via crowdsourcing methods. Its util...
متن کاملSubanta pada analyzer for Sanskrit
Natural language processing has wide coverage in application areas like machine translation , text to speech conversion , semantic analysis , semantic role labeling and knowledge representation .Morphological and syntactic processing are components of NLP which process each word to produce the syntactic structure of the sentence, with respect to its grammar .Semantic analysis follows syntactic ...
متن کاملGraceful Dialects
Programming languages are enormously diverse, both in their essential concepts and in their accidental aspects. This creates a problem when teaching programming. To let students experience the diversity of essential concepts, the students must also be exposed to an overwhelming variety of accidental and irrelevant detail: the accidental differences between the languages are likely to obscure th...
متن کاملGraceful and odd graceful labeling of some graphs
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
متن کاملLAF/GrAF-grounded Representation of Dependency Structures
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that there are at least two types of textual units that can be annotated with dependency information: words/tokens and chunks/phrases. Based on this consideration, we discuss a sub-typing of GrAF to represent the corresponding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Axioma
سال: 2023
ISSN: ['2622-8149', '2615-0697']
DOI: https://doi.org/10.56013/axi.v8i2.1544